B值随机变量阵列加权和的完全收敛性

设{X_ni:1≤i≤n,n≥1}为行间独立的B值r.v.阵列,g(z)是指数为1/p的正则变化函数,r>0,{ani 1≤t≤n,n≥1}为实数阵列,本文得到了使(?)成立的条件,推广并改进了Stout及Sung等的著名结论.     

可交换随机变量序列的随机极限定理

本文讨论了可交换随机变量序列{X_n:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果.     

Heuristic Rejection in Interval Global Optimization

Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach.     

Rational Functions with Prescribed Global and Local Minimizers

A family of multivariate rational functions is constructed. It has strong local minimizers with prescribed function values at prescribed positions. While there might be additional local minima, such minima cannot be global. A second family of multivariate rational functions is given, having prescribed global minimizers and prescribed interpolating data.     

加速牛顿迭代收敛的新方法

提出了加速牛顿迭代收敛的新思想，构造出一类加权牛顿迭代格式，通过选取最优加权因子，使得该格式具有高阶收敛性和较小的渐近误差常数。     

一个耦合系统自由边界问题的整体古典解

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｔｈｉｓｐａｐｅｒｗｅｄｉｓｃｕｓｓｔｈｅｇｌｏｂａｌｃｌａｓｓｉｃａｌｓｏｌｕｔｉｏｎｏｆａｍｕｌｔｉｄｉｍｅｎｓｉｏｎａｌｑｕａｓｉｓｔａｔｉｏｎａｒｙｐｒｏｂｌｅｍ .Ｔｈｅｐｒｏｂｌｅｍｃｏｍｅｓｆｒｏｍｔｈｅｄｉｓｃｕｓｓｉｏｎｏｆａｇｒｏｗｔｈｍｏｄｅｌｏｆｓｅｌｆｍａｉｎｔａｉｎｉｎｇｐｒｏｔｏｃｅｌｌ(ｓｅｅ [1— 3])ｉｎｍｕｌｔｉｄｉｍｅｎｓｉｏｎａｌｃａｓｅ .Ｔｈｅｐｒｏｔｏｃｅｌｌｃａｎｂｅｖｉｓｕａｌｉｚｅｄａｓｈａｖｉｎｇａｐｏｒｏｕｓｓｔ…     

Duffing-van der Pol振子随机分岔的全局分析

应用广义胞映射方法研究了参激和外激共同作用的Duffing-van der Pol振子的随机分岔.以 系统参数通过某一临界值时，如果系统的随机吸引子或随机鞍的形态发生突然变化，则认为 系统发生随机分岔为定义，分析了参激强度和外激强度的变化对于随机分岔的影响.揭示了 随机分岔的发生主要是由于系统的随机吸引子与系统的随机鞍碰撞产生的.分析表明，广义 胞映射方法是分析随机分岔的有力工具，这种全局分析方法可以清晰地给出随机分岔的发生 和发展. 关键词： 随机分岔 全局分析 广义胞映射方法 随机吸引子 随机鞍     

共轭下降法的全局收敛性

本文提出了一种Armijo型的线搜索，并在这种线搜索下讨论了共轭下降法的全局收敛性，且可得方法在每次迭代均产生一个下降搜索方向．     

基于增广Lagrange函数的RQP方法

Recursive quadratic programming is a family of techniques developd by Bartholomew-Biggs and other authors for solving nonlinear programming problems.This paperdescribes a new method for constrained optimization which obtains its search di-rections from a quadratic programming subproblem based on the well-known aug-mented Lagrangian function.It avoids the penalty parameter to tend to infinity.We employ the Fletcher‘s exact penalty function as a merit function and the use of an approximate directional derivative of the function that avoids the need toevaluate the second order derivatives of the problem functions.We prove that thealgorithm possesses global and superlinear convergence properties.At the sametime, numerical results are reported.     

The equivalence between the convergence of Ishikawa and Mann iterations with errors for strongly successively pseudocontractive mappings without Lipschitzian assumption

In this paper we prove some new equivalences between convergence of the Ishikawa and Mann iteration sequences with errors in two schemes by Xu [Y.G. Xu, Ishikawa and Mann iteration process with errors for nonlinear strongly accretive operator equations, J. Math. Anal. Appl. 224 (1998) 91-101] and Liu [L.S. Liu, Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces, J. Math. Anal. Appl. 194 (1995) 114-125], respectively, for strongly successively pseudocontractive mappings. Our main results improve and extend the corresponding results of the all references listed in this article.